recursive - определение. Что такое recursive
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое recursive - определение

PROCESS OF REPEATING ITEMS IN A SELF-SIMILAR WAY
Recursion definition; Recursive; Recursivity; Recursionism; Recursively; Infinite Recursion; Recursion, infinite; Recursor function; Recursionisms; Recursion (Concept); Recursion (concept); Recursive routine; Recursions; Recursion principle; Recursive structure; Infinite loop motif; Infinite-loop motif; Recursiveness; Mathematical recursion; Base case (recursion); Recursoin; Recursive step; Recurson; Recursive humour; Recursion in natural languages; Recursion (linguistics)
  • cocoa]] tin, designed by Jan Misset
  • Malyutin]], 1892
  • Front face of [[Giotto]]'s ''[[Stefaneschi Triptych]]'', 1320, recursively contains an image of itself (held up by the kneeling figure in the central panel).
  • [[Ouroboros]], an ancient symbol depicting a serpent or dragon eating its own tail.
  • The [[Sierpinski triangle]]—a confined recursion of triangles that form a fractal
  • Recently refreshed [[sourdough]], bubbling through [[fermentation]]: the recipe calls for some sourdough left over from the last time the same recipe was made.
Найдено результатов: 196
recursive         
recursive         
¦ adjective
1. chiefly Mathematics & Linguistics relating to or characterized by recursion.
2. Computing relating to or denoting a program or routine a part of which requires the application of the whole.
Derivatives
recursively adverb
Recursion         
·noun The act of recurring; return.
recursion         
<mathematics, programming> When a function (or procedure) calls itself. Such a function is called "recursive". If the call is via one or more other functions then this group of functions are called "mutually recursive". If a function will always call itself, however it is called, then it will never terminate. Usually however, it first performs some test on its arguments to check for a "base case" - a condition under which it can return a value without calling itself. The canonical example of a recursive function is factorial: factorial 0 = 1 factorial n = n * factorial (n-1) Functional programming languages rely heavily on recursion, using it where a procedural language would use iteration. See also recursion, recursive definition, tail recursion. [Jargon File] (1996-05-11)
Recursion         
Recursion (adjective: recursive) occurs when a thing is defined in terms of itself or of its type. Recursion is used in a variety of disciplines ranging from linguistics to logic.
recursion         
[r?'k?:?(?)n]
¦ noun chiefly Mathematics & Linguistics the repeated application of a procedure or rule to successive results of the process.
?a recursive procedure or formula.
General recursive function         
ONE OF SEVERAL EQUIVALENT DEFINITIONS OF A COMPUTABLE FUNCTION
Partial recursive function; Total recursive function; Mu-recursive; Mu recursive function; Mu-recursive function; Recursive function theory; M-recursive function; Μ recursion; General-recursive; General recursive; Recursive function (computability); Μ-recursive function; Μ-recursive
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursive function (sometimes shortened to recursive function).
recursive acronym         
ACRONYM WHOSE MEANING REFERS TO ITSELF
Self-referential acronym; Recursive acronyms; Recursive Acronym; Circular acronym; Recursive initialism; Recursive abbreviation; Metacronym; The TTP Project
<convention> A hackish (and especially MIT) tradition is to choose acronyms and abbreviations that refer humorously to themselves or to other acronyms or abbreviations. The classic examples were two MIT editors called EINE ("EINE Is Not Emacs") and ZWEI ("ZWEI Was EINE Initially"). More recently, there is a Scheme compiler called LIAR (Liar Imitates Apply Recursively), and GNU stands for "GNU's Not Unix!" - and a company with the name CYGNUS, which expands to "Cygnus, Your GNU Support". See also mung. [Jargon File] (1995-04-28)
Recursive science fiction         
SCIENCE FICTION ABOUT SCIENCE FICTION
Recursive alternate history; Recursive Science Fiction; Recursive fantasy fiction; Recursive simulation; Recursive plotting; Recursive science novel; Recursion time travel; Recursive fantasy; Recursive method; Recursive structures; Science fiction (recursive)
Recursive science fiction is a subgenre of science fiction, which itself takes the form of an exploration of science fiction within the narrative of the story.
Recursive acronym         
ACRONYM WHOSE MEANING REFERS TO ITSELF
Self-referential acronym; Recursive acronyms; Recursive Acronym; Circular acronym; Recursive initialism; Recursive abbreviation; Metacronym; The TTP Project
A recursive acronym is an acronym that refers to itself, and appears most frequently in computer programming. The term was first used in print in 1979 in Douglas Hofstadter's book Gödel, Escher, Bach: An Eternal Golden Braid, in which Hofstadter invents the acronym GOD, meaning "GOD Over Djinn", to help explain infinite series, and describes it as a recursive acronym.

Википедия

Recursion

Recursion occurs when the definition of a concept or process depends on a simpler version of itself. Recursion is used in a variety of disciplines ranging from linguistics to logic. The most common application of recursion is in mathematics and computer science, where a function being defined is applied within its own definition. While this apparently defines an infinite number of instances (function values), it is often done in such a way that no infinite loop or infinite chain of references ("crock recursion") can occur.

A process that exhibits recursion is recursive.